A Static Tasks Assignment Model For Grid Computing
نویسندگان
چکیده
Tasks assignment in grid computing is a challenge for most researchers and developers of these types of systems. This is due to characteristics inherent to grid infrastructures, namely, heterogeneity, dynamicity and scalability. It becomes much more complex when it comes to assign tasks with precedence constraints represented by a Directed Acyclic Graph. The task assignment problem is well known to be NP-complete. In this paper, we present and evaluate a dependent task assignment strategy for Grids. Our goal is two folds: first we reduce , whenever possible, the average response time of tasks submitted to the grid, and secondly, we reduce the transfer cost inducing by the tasks transfer respecting the dependency constraints.
منابع مشابه
Dynamic Dependent Tasks Assignment for Grid Computing
A computational grid is a widespread computing environment that provides huge computational power for large-scale distributed applications. One of the most important issues in such an environment is resource management. Task assignment as a part of resource management has a considerable effect on the grid middleware performance. In grid computing, task execution time is dependent on the machine...
متن کاملTasks assignment for Grid computing
A grid computing environment involves cooperation and sharing resources among distributed machines. Users may dispatch their tasks to remote computing resources instead of just computing locally. Hence, task assignment is an important issue in a grid computing environment. It plays a crucial role in achieving high utilisation of resources. Due to heterogeneity of resources, assigning an applica...
متن کاملTowards a hybrid load balancing policy in grid computing system
Grid computing has become conventional in distributed systems due to technological advancements and network popularity. Grid computing facilitates distributed applications by integrating available idle network computing resources into formidable computing power. As a result, by using efficient integration and sharing of resources, this enables abundant computing resources to solve complicated p...
متن کاملHybrid Meta-heuristic Algorithm for Task Assignment Problem
Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...
متن کاملParallelizing Assignment Problem with DNA Strands
Background:Many problems of combinatorial optimization, which are solvable only in exponential time, are known to be Non-Deterministic Polynomial hard (NP-hard). With the advent of parallel machines, new opportunities have been emerged to develop the effective solutions for NP-hard problems. However, solving these problems in polynomial time needs massive parallel machines and ...
متن کامل